Entrez un mot ou une phrase dans n'importe quelle langue 👆
Langue:
Traduction et analyse de mots par intelligence artificielle ChatGPT
Sur cette page, vous pouvez obtenir une analyse détaillée d'un mot ou d'une phrase, réalisée à l'aide de la meilleure technologie d'intelligence artificielle à ce jour:
- comment le mot est utilisé
- fréquence d'utilisation
- il est utilisé plus souvent dans le discours oral ou écrit
- options de traduction de mots
- exemples d'utilisation (plusieurs phrases avec traduction)
- étymologie
dynamic$23402$ - traduction vers allemand
Dynamic algorithm; Dynamic Algorithms; Dynamic problem
dynamic
adj. dynamisch, energetisch
dynamic analysis
METHOD OF ANALYSING THE IMPACT OF FISCAL POLICY CHANGES BY FORECASTING THE EFFECTS OF ECONOMIC AGENTS' REACTIONS TO INCENTIVES CREATED BY POLICY
Dynamic analysis
dynamische Analyse (Untersuchung von Variablen und Trends)
Fast Page Mode
![[[MoSys]] MDRAM MD908](https://commons.wikimedia.org/wiki/Special:FilePath/MoSys MD908.png?width=200 "[[MoSys]] MDRAM MD908")
![1 Mbit high speed [[CMOS]] pseudo static RAM, made by [[Toshiba]]](https://commons.wikimedia.org/wiki/Special:FilePath/Olivetti JP90 - Toshiba TC518129CFWL-80 on controller-8514.jpg?width=200 "1 Mbit high speed [[CMOS]] pseudo static RAM, made by [[Toshiba]]")
![NMOS]] DRAM cell. It was patented in 1968.](https://commons.wikimedia.org/wiki/Special:FilePath/Original 1T1C DRAM design.svg?width=200 "NMOS]] DRAM cell. It was patented in 1968.")
![die]] of a Samsung DDR-SDRAM 64MBit package](https://commons.wikimedia.org/wiki/Special:FilePath/SAMSUNG@DDR-SDRAM@64MBit@K4D62323HA-QC60 Stack-DSC03539-DSC03556 - ZS-DMap.jpg?width=200 "die]] of a Samsung DDR-SDRAM 64MBit package")
![A 512 MBit [[Qimonda]] GDDR3 SDRAM package](https://commons.wikimedia.org/wiki/Special:FilePath/Sapphire Ultimate HD 4670 512MB - Qimonda HYB18H512321BF-10-93577.jpg?width=200 "A 512 MBit [[Qimonda]] GDDR3 SDRAM package")
RANDOM-ACCESS MEMORY THAT STORES EACH BIT OF DATA IN A SEPARATE CAPACITOR WITHIN AN INTEGRATED CIRCUIT
DRAM (memory); Pseudostatic RAM; PSRAM; Pseudostatic Random Access Memory; Window RAM; Dynamic RAM; EDO RAM; Fast Page Mode DRAM; FPM RAM; FPM DRAM; Fast Page Mode RAM; BEDO (RAM); MDRAM; Row Access Strobe; Column Access Strobe; CAS access time; Precharge interval; Row address select; Column address select; 1T DRAM; DDRAM; D-RAM; EDO DRAM; Fast page mode; Page mode memory; Extended Data Out RAM; BEDO RAM; Burst EDO; Multibank DRAM; Intel 1102; Burst EDO DRAM; Memory Timing; Dynamic Random Access Memory; FPRAM; Dynamic random access memory; Extended data out DRAM; Extended Data Out DRAM; Dynamic Random access memory; Static column RAM; Memory row; DRAM row; Row activation; WRAM (memory); 1T1C; 1t1c; 3T1C; Page mode RAM; Page mode DRAM; DRAM; D. R. A. M.; D.R.A.M.; DRAM memory; Asynchronous DRAM; EDO memory; Fast page mode DRAM; Window DRAM; Video DRAM; Nibble mode; EDO SGRAM
Typ eines Direktzugriffsspeichers der schnellen Zugang in der aktuellen offenen Zeile zu Daten erlaubt (nach dem ersten Zugang zu einer Adresse besteht kein Bedarf nochmal diese Adresse anzusteuern)
Définition
dynamic analysis
<programming> Evaluation of a program based on its execution.
Dynamic analysis relies on executing a piece of software with
selected test data.
(1996-05-13)
Wikipédia
Dynamic problem (algorithms)
Dynamic problems in computational complexity theory are problems stated in terms of the changing input data. In the most general form a problem in this category is usually stated as follows:
- Given a class of input objects, find efficient algorithms and data structures to answer a certain query about a set of input objects each time the input data is modified, i.e., objects are inserted or deleted.
Problems of this class have the following measures of complexity:
- Space – the amount of memory space required to store the data structure;
- Initialization time – time required for the initial construction of the data structure;
- Insertion time – time required for the update of the data structure when one more input element is added;
- Deletion time – time required for the update of the data structure when an input element is deleted;
- Query time – time required to answer a query;
- Other operations specific to the problem in question
The overall set of computations for a dynamic problem is called a dynamic algorithm.
Many algorithmic problems stated in terms of fixed input data (called static problems in this context and solved by static algorithms) have meaningful dynamic versions.
